Compositionality of optimal control laws
نویسنده
چکیده
We present a theory of compositionality in stochastic optimal control, showing how task-optimal controllers can be constructed from certain primitives. The primitives are themselves feedback controllers pursuing their own agendas. They are mixed in proportion to how much progress they are making towards their agendas and how compatible their agendas are with the present task. The resulting composite control law is provably optimal when the problem belongs to a certain class. This class is rather general and yet has a number of unique properties – one of which is that the Bellman equation can be made linear even for non-linear or discrete dynamics. This gives rise to the compositionality developed here. In the special case of linear dynamics and Gaussian noise our framework yields analytical solutions (i.e. non-linear mixtures of LQG controllers) without requiring the final cost to be quadratic. More generally, a natural set of control primitives can be constructed by applying SVD to Green’s function of the Bellman equation. We illustrate the theory in the context of human arm movements. The ideas of optimality and compositionality are both very prominent in the field of motor control, yet they have been difficult to reconcile. Our work makes this possible.
منابع مشابه
Sample Efficient Path Integral Control under Uncertainty
We present a data-driven stochastic optimal control framework that is derived using the path integral (PI) control approach. We find iterative control laws analytically without a priori policy parameterization based on probabilistic representation of the learned dynamics model. The proposed algorithm operates in a forward-backward sweep manner which differentiate it from other PI-related method...
متن کاملLinearly Solvable Optimal Control
We summarize the recently-developed framework of linearly-solvable stochastic optimal control. Using an exponential transformation, the (Hamilton-Jacobi) Bellman equation for such problems can bemade linear, giving rise to efficient numericalmethods. Extensions to game theory are also possible and lead to linear Isaacs equations. The key restriction that makes a stochastic optimal control probl...
متن کاملImplementing Reactive Algorithms on a Cellular Control Architecture
This paper deals with a cellular control architecture and the implementation of reactive algorithms on it. Two examples reveal that, to extend a behaviour-based architecture by equipping it with additional reactive algorithms, the arbitration, otherwise action selection, problem has to be redefined in terms of the interaction laws of the algorithms involved. The principles of modularisation and...
متن کاملCOMPARISON BETWEEN MINIMUM AND NEAR MINIMUM TIME OPTIMAL CONTROL OF A FLEXIBLE SLEWING SPACECRAFT
In this paper, a minimum and near-minimum time optimal control laws are developed and compared for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The control commands are considered as typical bang-bang with multiple symmetrical switches, the time optimal control solution for the rigid-body mode is obtained as a bang-bang function and app...
متن کاملMinimum Description Length and Compositionality
In [12] we have shown that the standard de nition of compositionality is formally vacuous; that is, any semantics can be easily encoded as a compositional semantics. We have also shown that when compositional semantics is required to be "systematic", it is possible to introduce a non-vacuous concept of compositionality. However, a technical de nition of systematicity was not given in that paper...
متن کامل